Complete Boolean algebra

Results: 108



#Item
71Algebraic structures / Order theory / Lattice theory / Abstract algebra / Mathematical structures / Lattice / Boolean algebra / Category / Complete lattice / Mathematics / Structure / Topology

Algebraic General Topology∗ Volume 1 Victor Porton Web: http://www.mathematics21.org June 27, 2014

Add to Reading List

Source URL: www.mathematics21.org

Language: English - Date: 2014-06-27 11:54:36
72Structure / Topology / General topology / Category theory / Filter / Boolean algebra / Lattice / Complete Heyting algebra / Pointless topology / Order theory / Mathematics / Algebraic structures

Pointfree funcoids as a generalization of frames by Victor Porton Email: [removed] Web: http://www.mathematics21.org August 29, 2013 Abstract

Add to Reading List

Source URL: www.mathematics21.org

Language: English - Date: 2013-11-08 07:27:31
73Logic in computer science / NP-complete problems / Boolean algebra / Constraint programming / Electronic design automation / Maximum satisfiability problem / Boolean satisfiability problem / 2-satisfiability / Resolution / Theoretical computer science / Mathematics / Applied mathematics

Journal on Satisfiability, Boolean Modeling and Computation[removed] The First and Second Max-SAT Evaluations Josep Argelich [removed]

Add to Reading List

Source URL: jsat.ewi.tudelft.nl

Language: English - Date: 2008-10-01 08:14:56
74Automated theorem proving / Logic in computer science / NP-complete problems / Boolean algebra / Logic programming / Boolean satisfiability problem / Unit propagation / Resolution / Clause / Theoretical computer science / Mathematics / Mathematical logic

Preprocessing and Inprocessing Techniques in SAT Armin Biere Institute for Formal Models and Verification Johannes Kepler University Linz, Austria

Add to Reading List

Source URL: www.kr.tuwien.ac.at

Language: English - Date: 2011-09-06 10:46:19
75Boolean algebra / Algebraic structures / Order theory / Algebraic logic / Field of sets / Ideal / Complete Heyting algebra / Heyting algebra / Interior algebra / Mathematics / Abstract algebra / Mathematical logic

Logical Aspects of Set Constraints Dexter Kozen Computer Science Department Cornell University Ithaca, New York 14853, USA [removed]

Add to Reading List

Source URL: www.cs.cornell.edu

Language: English - Date: 2012-05-29 09:46:24
76Constraint programming / Boolean algebra / Automated theorem proving / Logic in computer science / NP-complete problems / Boolean satisfiability problem / DPLL algorithm / Satz / Solver / Theoretical computer science / Applied mathematics / Mathematics

Annales Mathematicae et Informaticae[removed]pp. 9–21 http://ami.ektf.hu Cube-and-Conquer approach for SAT solving on grids∗

Add to Reading List

Source URL: ami.ektf.hu

Language: English - Date: 2013-12-20 13:48:28
77Algebra / Algebraic structures / Order theory / Convex geometry / Distributive lattice / Lattice / Boolean algebra / Complete lattice / Closure operator / Abstract algebra / Mathematics / Lattice theory

Lattice games J. M. Bilbao Departamento de Matemática Aplicada II Escuela Superior de Ingenieros, Camino de los Descubrimientos s/n[removed]Sevilla, Spain. E-mail: [removed]

Add to Reading List

Source URL: www.esi2.us.es

Language: English - Date: 2000-12-05 16:35:18
78Boolean algebra / NP-complete problems / Logic in computer science / Electronic design automation / Formal methods / Boolean satisfiability problem / True quantified Boolean formula / Interpretation / Constraint satisfaction problem / Theoretical computer science / Computational complexity theory / Applied mathematics

A Generalization of SAT and #SAT for Robust Policy Evaluation∗ Erik Zawadzki Andr´e Platzer Geoffrey J. Gordon

Add to Reading List

Source URL: www.cs.cmu.edu

Language: English - Date: 2013-11-06 19:31:44
79Complexity classes / Finite model theory / Boolean algebra / Predicate logic / Boolean satisfiability problem / True quantified Boolean formula / NP-complete / Description logic / FO / Theoretical computer science / Computational complexity theory / Applied mathematics

3 Complexity of Reasoning Francesco M. Donini

Add to Reading List

Source URL: www.inf.unibz.it

Language: English - Date: 2011-09-08 09:53:48
80Electronic design automation / Formal methods / Logic in computer science / NP-complete problems / Boolean algebra / Lookup table / Satisfiability Modulo Theories / FO / Boolean satisfiability problem / Theoretical computer science / Logic / Mathematical logic

A Quantifier Elimination Algorithm for Linear Modular Equations and Disequations ⋆ Ajith K John1 and Supratik Chakraborty2 1 2

Add to Reading List

Source URL: www.cse.iitb.ac.in

Language: English - Date: 2012-06-17 16:38:49
UPDATE